Message routing system



1967 J. A. MOLAUGHLIN 3,302,176

MESSAGE ROUTING SYSTEM Filed Dec. 7, 1962 19 Sheets-Sheet 1 F|G.| us

FIRST sues B no F 7 i2 RECOIRD i I i I I SOURCE G2 p L. J .J

comm COUNTER Fl G. 2

*- POSITION TIME 0 micono SOURCE INVENTOR. I22 JOHN A.McLAUGHLIN SPEUCLTOER 0 |0 \0 |n i BY I H soua cf \m F/rw l MA A ATTORNEYS n- 1967 J. A. MCLAUGHLIN MESSAGE ROUTING SYSTEM 19 Sheets-Sheet 2 Filed Dec.

E I E E E A 0 A INVENTOR,

JOHN A. McLAUGHLIN l 80PHASE SHIFT CIRCUIT BIT RATE OSCILLATOR moauEis FIG. 5

Jan. 31, 1967 A, M LAUGHLIN 3,302,176

MESSAGE ROUTING SYSTEM Filed Dec. 7, 1962 19 Sheets-Sheet 3 0 111mm Jmmml I I I? 1,. J J"1.

| i I l l r"?? i I X N L IL L JU1L JL 1 i g I 4 I :OtlxZffl niR I I comm RECORD worm mm 1 7 DE 0 am: N

JNVENTOR JOHN A. MCLAUGHLIN Jan. 31, 1967 J. A. MCLAUGHLIN 3,302,176

MESSAGE ROUTING SYSTEM Filed Duo. r 1962 19 Sheets-Sheet 5 32 FIG. 9

RESET LINE SET LINE 22| SECTOR PULSE SOURCE 0 M0 i Q 2 D 3|O L P c Fl G. l l 0 1 T p L 1 0 INVENTORT JOHN A. McLAUGHLI N 51 ,3l2 BY w K E RECORD REQUESTING [mu/1, M 1 SOURCE STATION T 1 ATTORNEYS Jan. 31, 1967 J, A. MCLAUGHLIN MESSAGE ROUTING SYSTEM 19 Sheets-Sheet u Filed Dec.

m 5 O 2 O s 2 2 2 0 o N O o 2 2 2 O M O o o m U 2 s 2 Q; o o m 2 m s z 2 o O o n m 2 2 2 E o 2 Am. 2

2; W U N @M n 2 3 2 N O o 1 2 Q 2 z 2 o o M O mv m m e 2 2 z 2 o o om O@ w mzsrze moo jonOmw o h wauezszzme @6110 Q D. -@m2 :N 3$2 M O of Q L mm w K 2; 2 2 m. s 01 10 0 mv cwm n 2 2 w 901:; 2 m Q U N @W Q @QN 2 32 a; 2 :2 Q m n @m w 3% m f g m Qm m Q m 0 m z sm o2 N OW. Q O N fofofi Q 2 s mrul s m 0 651016; :1 o mg g W p H m P/MA/ L Mi? ATTORNEYS 1967 J. A. M LAUGHLIN 3,

MESSAGE ROUTING SYSTEM Filed D60. '1', 1962 19 Sheetsf5heet 8 STAGE I RESET RESET 0 0 0 0 0 INVENTOR Hmm, 0W1 I A T T U R N E Y5 Jan. 31, 1967 Filed D00. '1',

TO GATTNG CIRCUITS COMMON CONTROL LOGIC J. A. M LAUGHLIN MESSAGE ROUTING SYSTEM 19 Sheefi-Sheet.

2 TNTERVTTL DELAY DIS 1s INTERVAL 1' DELAY G l f M a INTERVAL j Lfl DELAY INTERVAL 4 l I '77- J REQUESTING STAT! 0N5 FREQUENCY 4'9 1 T t 1 t I M5 DTTIDER A BIT RING K TTT S (1,; v 1 i J 1 K K, T H JH INVENTOR JOHN A. MCLAUGHLI N ZINE/I, T f 3H AT T 0 R N E Y S Jan. 31, 1967 J MGLAUGHLIN 3,302,176

MESSAGE ROUTING SYSTEM Filed Dec. 7, 1962 19 Sheets-Sheet P FIG. l6 H mcomuc H J LINES sfl 516 g l L64 64 J a R n R R R oumomc LINES INVENTOR JOHN A. McLAUGHLIN Anoams 1957 J A. M LAUGHLJN MESSAGE ROUTING SYSTEM 19 Sheets-Sheet 11 Filed Dec. 2. 1902 llllllllllllllllllllllllllll J W I 5 1K T A R6 u l n m m a o a. 2 5 8 m 0 TM: M w H1 FL 0M A 0 l m K n W u 4 m u m m 0 5 7 V T w L R6 m A n u k cm I b 2 r 8 K 5 P I 0 G m It F r a 9 JNVENTOR JOHN A. MCLAUGHLIN ATTQRNEYS Jan. 31, 1967 J A, MOLAUGHLIN 3,302,176

MESSAGE ROUTING SYSTEM Filed Dec. 7, 1962 19 Sheets-5heet 12 FIG. 20 FROM (164) ms,1 8 E F hes-25in DATA OUT DATA IN INVENTOR JOHN A. MCLAUGHLI N Jan. 31, 1967 A. MCLAUGHLIN 3,302,176

MESSAGE ROUTING SYSTEM Filed Dec. 7. 1962 19 Sheets-Sheet 1.5

Fl G. 2 5 H 2 4 65] 652 655 654 DATA OUT DATA IN FIG. 2?

HEAD m om m our IN OUT w R w 2 w R w INVENTOR. JOHN A. McLAUGHLlN Y mm M @0 1;

ATTURN EYS Jan. 31, 1967 J A MCLAUGHUN 3,302,176

MESSAGE ROUTING SYSTEM JOHN A. MCLAUGHLIN BY I r! I HM/11 22 5522 A] TORNEYS 1967 .1. A. MCLAUGHLIN MESSAGE ROUTING SYSTEM 19 Sheets-Sheet 16 Filed DOC.

FIG. 30

INVENTOR. JOHN A. McLAUGHLlN F ATTORNEYS 1967 J. A. M LAUGHLIN MESSAGE ROUTING SYSTEM 19 Sheets-fheet 115 Filed Dec.

O 35.20 m diam n: L a A 2 5a 226523 0 o m L: 53 mm INVENTOR. JOHN A. McLAUGHLIN momma Jan. 31, 1967 J M LAUGHLIN 3,302,176

MESSAGE ROUTING SYSTEM ATTORNEYS United States Patent 3,302,176 MESSAGE ROUTING SYSTEM John A. McLaughlin, Los Gatos, Calif., assignnr to International Business Machines Corporation, New York, N.Y., a corporation of New York Filed Dec. 7, I962, Ser. No. 243,063 44 Claims. (Cl. 340-4725) This invention relates to data processing systems, and in particular to message routing systems which manipulate data in the time domain to transfer data between an input system and an output system.

The field of data processing concerns, among other things, the conversion of uninterpreted or unorganized data into some form of electrical or mechanical signal and the subsequent transmission and utilization of the signals at higher speeds than would otherwise be possible. The techniques of automatic electronic data processing are being increasingly applied where large amounts of data must be stored, processed or presented, as in keeping commercial records, undertaking scientific testing and performing complex calculations.

The functions used in data processing may be broadly categorized under four different headings. A first of these functions may be termed input or read-in and is concerned with converting initially received data into one of the signal forms which is to be used in the system. Data storage is a second function, by means of which converted information is temporarily or permanently held for later use. The computing or calculating function involves the manipulation and use of the converted information; this function includes various operations, such as, modification of the data according to other information, use of the data to obtain new information, basic arithmetic steps, and even the transmission of the data between different points. The fourth and final function may be termed output or readout and may be described as involving operations in which the converted and modi fied data is returned to its original form or some other form which is directly useful to the user of the data processing machine.

Modern data processing systems employ a variety of components and combinations for performing these different functions. The components and combinations seldom have fully compatible characteristics, however. In particular, serious incompatibilities as to time domain characteristics can exist; to illustrate, many processing operations can be carried out at high speed by electronic circuits, whereas other operations are efl'ected by mechanical devices which inherently involve slower speeds. Read-in and read-out operations, for example, depend heavily upon mechanical techniques which are orders of magnitude slower than the purely electronic techniques now used for memory and computation functions. Many operators preparing input data by hand, as by key punch devices, are needed to supply sufiicient data to utilize the capacity of a modern data processing system. Furthermore, the stored information within a magnetic core memory may be transmitted therefrom to be read out by a high speed printer, which even though extremely fast compared to conventional printers still relies upon mechanical movement and so operates much slower than the electronic parts of the system.

Differences in the data handling capabilities of different units within a system therefore reduce system eficiency and increase cost. High computing speeds can be achieved by using costlier elements and more complex circuits, but these expenses are unjustified if the speed capabilities of the computing units are not fully utilized. The usual techniques employed are to introduce special buffers or intermediate storages between the different ice units, or to multiply the number of input and output devices. Such techniques utilize elementary time domain systems to merely compress or expand data on the time sc lc, or bypass time domain problems simply by adding more equipment.

Differences in the operating rates of different components or combinations involve only one of the time domain problems encountered by data processing systems. Even though two functional units may have like data rates, delays in the transfer of information may be necessary because of incompatibilities between data supply and demand. in other words, the supply of information to a particular unit may be out of phase with the demand from that unit for more information. A common illustration of this problem can be found in a central telegraph station which has incoming lines from many different sending stations. The central receiving station will often be engaged in receiving messages from one or more sending stations at the same time that an additional one of the sending stations is ready to transmit a message. Thus there is a surplus of messages when there is no additional demand from the receiving station.

Another particular illustration of incompatibility between supply and demand rates of different components arises in the storage of randomly occurring messages at the input to a circulating memory. A circulating memory will store the messages in a continuous sequence while maintaining them in the order in which they are received. The time domain problem encountered herein may be simply illustrated by assuming that the circulat ing memory has a capacity of ten successive messages and that the first three messages are already arranged in order on this memory. Now assume that message number four arrives at the input station for the circulating memory when the input station is adjacent the storage position of message number two. Obviously message number four cannot be immediately recorded upon the circulating memory at that time without interfering with message number two. Suppose, in another instance, that the same message number four arrives at the input station for the circulating memory when the input station is located adjacent to message position number five on the memory. In this position. message number four can be transcribed without interfering with previously recorded messages. but it will not be in the prescribed successive order. The message must then be transcribed in a position which should be reserved for the next incoming mes sage, or must be held almost a full rotation of the circulating memory until position number four is again available to the input station.

A similar situation is obtained when the messages are already transcribed upon a circulating memory in a prescribed order and a read-out device is demanding messages therefrom at random times. in other words, the demand for a particular message, such as number four. may occur when the output device on the circulating memory is adjacent a difi'erent numbered message. such as message number seven. Here again the demanding station would be required to wait the rotation of the memory to the correct position before receiving the correct output signal.

The two problems presented above in connection with the circulating ,BIHOIY are both characterized by the fact that either the sending or receiving station is presenting information to the other at a random rate, whereas the other is only capable of receiving this information in a time ordered fashion. This is a very simple problem in message routing, because only a single random source is involved. The problems are greatly multiplied when both sending and receiving stations supply and receive messages in random fashion. For example, a pair of messages, which are to be adjacent in time, such as mes- 

1. A SIGNAL ROUTING CIRCUIT FOR TRANSFERRING DATA PROVIDED IN SEPARATE GROUPINGS, COMPRISING: A FIRST DATA STATION INCLUDING SUPPLY MEANS PROVIDING DATA GROUPINGS IN A PREDETERMINED ORDER; A SECOND DATA STATION INCLUDING DEMAND MEANS FOR REQUESTING DATA GROUPINGS IN SAID PREDETERMINED ORDER BUT AT RANDOM TIMES RELATIVE TO THE DATA GROUPINGS WHICH ARE PROVIDED; DELAY MEANS HAVING A CONTROLLABLY VARIABLE DELAY TIME AND COUPLING THE FIRST DATA STATION TO THE SECOND DATA STATION; AND CONTROL MEANS RESPONSIVE TO PROVIDED AND REQUESTED DATA GROUPINGS FOR MAINTAINING A CONTINUOUS COMPUTATION OF THE TIME DIFFERENCE BETWEEN THE TIMES OF SUPPLY AND DEMAND FOR CONTROLLING THE DELAY TIME OF THE DELAY MEANS. 